Flow shop operator scheduling through constraint satisfaction and constraint optimisation techniques
نویسندگان
چکیده
Workers scheduling in not highly automated production lines is an important task, especially when in a production line the number of operators is less than the number of workstations. Finding an optimal distribution plan can increase the line throughput, managing the workforce and the workload in a better way. This work focuses on the operator-scheduling problem for an electromechanical assembly line. Workforce distribution on the workstations has been made with a centralised scheduling based on a mathematical model which, through constraint optimisation principles, is able to find the optimal distribution of workforce optimising fundamental parameters, such as man-hours, throughput, makespan and work in process.
منابع مشابه
Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملIntegrating Mixed-Integer Optimisation and Satisfiability Modulo Theories: Application to Scheduling
One way to address multi-scale optimisation problems is by integrating logic and optimisation. For example, a scheduling problem may have two levels: (i) assigning orders to machines and (ii) sequencing orders on each machine. In a minumum cost model, assigning orders to machines is a mixed-integer optimisation problem, sequencing orders is a constraint satisfaction problem. The entire problem ...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملDistributed Constraint Satisfaction through Constraint Partition and Coordinated Reaction
We present a methodology, called Constraint Partition and Coordinated Reaction (CP&CR), for distributed constraint satisfaction based on partitioning the set of constraints into subsets of different constraint types. Associated with each constraint type is a set of specialized agents, each of which is responsible for enforcing constraints of the specified type for the set of variables under its...
متن کاملBi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem
This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
متن کامل